Fast extraction of polyhedral model silhouettes from moving viewpoint on curved trajectory

نویسندگان

  • Ku-Jin Kim
  • Nakhoon Baek
چکیده

The efficient extraction of model silhouettes is essential in many applications, such as non-photorealistic rendering, backface culling, shadow computation, and computing swept volumes. For dynamically moving viewpoints, efficient silhouette extraction is more important for system performance. Accordingly, this paper presents an incremental update algorithm for computing a perspective silhouette sequence for a polyhedral model. The viewpoint is assumed to move along a given trajectory qðtÞ, where t is the time parameter. As the preprocessing step, the time-intervals during which each model edge is contained in the silhouette, defined as silhouette time-intervals, are computed using two major computations: (i) intersecting qðtÞ with two planes and (ii) a number of dot products. If qðtÞ is a curve of degree n, there are at most n þ 1 silhouette time-intervals for an individual edge. The silhouette time-intervals are then used to determine the edges that should be added or deleted from the previous silhouette for each discrete viewpoint, thereby providing an optimal way to compute a sequence of silhouettes. A search-based algorithm is also presented that extracts the silhouette edges for each time point tj by searching the silhouette time-intervals containing tj . The performance of the proposed algorithms is analyzed and experimental results are compared with those for the anchored cone algorithm suggested by Sander et al. [In: Akeley K, editor. Siggraph 2000, Computer Graphics Proceedings. Annual Conference Series. New York/Reading, MA/New York: ACM Press/ACM SIGGRAPH/Addison-Wesley/Longman; 2000. p. 327–34.] r 2005 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On incremental rendering of silhouette maps of a polyhedral scene

We consider the problem of incrementally rendering a polyhedral scene while the viewpoint is moving. In practical situations the number of geometric primitives to be rendered can be very large — hundreds of thousands or millions, but these may come from only a moderate number of objects that happen to have been finely tessellated. It is sometimes advantageous to render only the silhouettes of t...

متن کامل

In Proceedings of CVPR ' 96 Structure and Motion of Curved 3 D Objects fromMonocular Silhouettes

The silhouette of a smooth 3D object observed by a moving camera changes over time. Past work has shown how surface geometry can be recovered using the deformation of the silhouette when the camera motion is known. This paper addresses the problem of estimating both the full Euclidean surface structure and the camera motion from a dense set of silhouettes captured under orthographic or scaled o...

متن کامل

Structure and motion of curved 3D objects from monocular silhouettes

The silhouette of a smooth 3D object observed by a moving camera changes over time. Past work has shown how surface geometry can be recovered using the deformation of the silhouette when the camera motion is known. This paper addresses the problem of estimating both the full Euclidean surface structure and the camera motion from a dense set of silhouettes captured under orthographic or scaled o...

متن کامل

Approximate General Sweep Boundary of a 2D Curved Object,

This paper presents an algorithm to compute an approximation to the general sweep boundary of a 2D curved moving object which changes its shape dynamically while traversing a trajectory. In eeect, we make polygonal approximations to the trajectory and to the object shape at every appropriate instance along the trajectory so that the approximated polygonal sweep boundary is within a given error ...

متن کامل

Measures for Silhouettes Resemblance and Representative Silhouettes of Curved Objects

We claim that the task of object recognition necessitates a measure for image likelihood, that is: a measure for the probability that a given image is obtained from a familiar (pre-investigated) object. Moreover, in a system where objects are represented by 2D images, the best performance is achieved if those images are selected according to a maximum likelihood principle. This is equivalent to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Graphics

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2005